Three-valued free tense logic.

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Programming in Three-valued Logic

The aim of this paper is to propose a logical and algebraic theory which seems well-suited to logic programs with negatior, and deductive databases. This theory has similar properties to those of Prolog theory limited to programs with Horn clauses and tbns can be considered as sn extension of the usual theory. This parallel with logic programming without negation lies in the introduction of a t...

متن کامل

Learning Three-Valued Logic Programs

We show that the adoption of a three-valued setting for inductive concept learning is particularly useful for learning. Distinguishing between what is true, what is false and what is unknown can be useful in situations where decisions have to be taken on the basis of scarce information. In order to learn in a three-valued setting, we adopt Extended Logic Programs (ELP) under a Well-Founded Sema...

متن کامل

Algebraization of the Three-valued BCK-logic

In this paper a definition of n-valued system in the context of the algebraizable logics is proposed. We define and study the variety V3, showing that it is definitionally equivalent to the equivalent quasivariety semantics for the “Three-valued BCK-logic”. As a consequence we find an axiomatic definition of the above system. Mathematics Subject Classification: 03B50, 03G25, 06F35.

متن کامل

Probabilistic Inference on Three-Valued Logic

In this paper, we extend Nilsson’s probabilistic logic [1] to allow that each sentence S has three sets of possible worlds. We adopt the ideas of consistency and possible worlds introduced by Nilsson in [1], but propose a new method called linear equation method to deal with the problems of probabilistic inference, the results of our method is consistent with those of Yao’s interval-set model m...

متن کامل

Logic Programs under Three-Valued Lukasiewicz Semantics

If logic programs are interpreted over a three-valued logic, then often Kleene’s strong three-valued logic with complete equivalence and Fitting’s associated immediate consequence operator is used. However, in such a logic the least fixed point of the Fitting operator is not necessarily a model for the program under consideration. Moreover, the model intersection property does not hold. In this...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Notre Dame Journal of Formal Logic

سال: 1977

ISSN: 0029-4527

DOI: 10.1305/ndjfl/1093887824